Cr(VI) and Cu(II) removal from aqueous solution in fixed bed column using rice bran; experimental,statistical and GA modelling

Rice bran, a green and low-cost adsorbent, is used for Chromium (VI) and Copper (II) remotion from its aqueous solution. The influence of different process parameters in a fixed-bed on the removing efficiency has been investigated. The results show that the removal efficiency is higher at a minimum flow rate, low metal ion concentration, and higher bed height. The adsorption studies show that the rice bran has a better affinity to Chromium (VI) than Copper (II). Different kinetic models are used for the prediction of the column performance. This study shows that rice bran could be a potential and eco-friendly adsorbent for chromium (VI) and copper (II) removal and is suitable for developing countries like India. Multiple linear regression and ANN-based genetic algorithm modelling have been applied successfully to predict both metal ions' percentage removal separately.     

Generating 2-Gray codes for ballot sequences in constant amortized time

We present a simple algorithm that generates a cyclic 2-Gray code for ballot sequences. The algorithm generates each ballot sequence in constant amortized time using a linear amount of space. This is the first known cyclic 2-Gray code for ballot sequences that achieves this time bound. In addition, the algorithm can be easily modified to output ballot sequences in binary reflected Gray code order in constant amortized time per string using a linear amount of space.     

Optimal Control for Multiscale Elliptic Equations with Rough Coefficients

This paper concerns the convex optimal control problem governed by multiscale elliptic equations with arbitrarily rough $L^\infty$ coefficients, which has not only complex coupling between nonseparable scales and nonlinearity, but also important applications in composite materials and geophysics. We use one of the recently developed numerical homogenization techniques, the so-called Rough Polyharmonic Splines (RPS) and its generalization (GRPS) for the efficient resolution of the elliptic operator on the coarse scale. Those methods have optimal convergence rate which do not rely on the regularity of the coefficients nor the concepts of scale-separation or periodicity. As the iterative solution of the nonlinearly coupled OCP-OPT formulation for the optimal control problem requires solving the corresponding (state and co-state) multiscale elliptic equations many times with different right hand sides, numerical homogenization approach only requires one-time pre-computation on the fine scale and the following iterations can be done with computational cost proportional to coarse degrees of freedom. Numerical experiments are presented to validate the theoretical analysis.     

Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method

In this paper, we propose a Quasi-Orthogonal Matching Pursuit (QOMP) algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials. For the two kinds of sampled data, data with noises and without noises, we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct $s$-sparse Legendre polynomials, Chebyshev polynomials and trigonometric polynomials in $s$ step iterations. The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials. Finally, numerical experiments will be presented to verify the effectiveness of the QOMP method.     

面向绿色智能制造的高维多目标动态作业车间调度优化

在当前环境问题日益严峻情况下,绿色智能制造受到广泛关注。在动态柔性作业车间基础上考虑不同机器状态下的能耗情况、机器使用节能方法,构建以极小化总能耗、最大完工时间、机器总负荷和产品质量稳定性为目标的高维多目标绿色动态柔性作业车间调度模型,并设计改进的灰狼优化IMOGWO算法求解该问题。首先,采用反向学习初始化种群策略,以扩大种群多样性;然后,依据多目标问题和标准GWO算法的特点提出多级官员领导机制,并引入POX交叉和逆序变异算子;最后,改进精英保留策略用于多目标优化算法。为证明算法的有效性,设计两组仿真实验分别对三种算法进行比较。实验结果表明,运用本文改进的IMOGWO算法求解多目标问题有更好的收敛性和分布性。     

一种新的求解拟单调变分不等式的压缩投影算法

2020年Liu和Yang提出了求解Hilbert空间中拟单调且Lipschitz连续的变分不等式问题的投影算法,简称LYA。本文在欧氏空间中提出了一种新的求解拟单调变分不等式的压缩投影算法,简称NPCA。新算法削弱了LYA中映射的Lipschitz连续性。在映射连续、拟单调且对偶变分不等式解集非空的条件下得到了NPCA所生成点列的聚点是解的结论。当变分不等式的解集还满足一定条件时,得到了NPCA的全局收敛性。数值实验结果表明NPCA所需的迭代步数少于LYA的迭代步数,NPCA在高维拟单调例子中所需的计算机耗时也更少。     

基于连续小波变换下的土壤有害元素砷含量估测

与传统检测方法相比,利用高光谱技术进行土壤有害元素砷含量的估算,具有快速、准确,成本低的特点,可对干旱区绿洲土壤有害元素砷污染进行动态监测。基于新疆渭干河-库车河三角洲绿洲耕层土壤样品的采集,获取土壤光谱数据和有害元素砷含量。通过bior1.3,db4,gaus4和mexh这4种小波基函数对土壤原始光谱反射率进行连续小波变换,并将变换后光谱数据与有害元素砷进行相关分析,以筛选出的敏感小波系数为自变量,采用偏最小二乘回归、支持向量机回归、BP神经网络和随机森林回归方法对有害元素砷含量进行高光谱反演。研究结果显示：（1）4种小波基函数在3~8尺度的光谱分解效果明显优于其他尺度,特别是4~6尺度的连续小波变换有效提升了光谱反射率与土壤有害元素砷之间的相关性,通过显著性检验的小波系数数量有了明显增多（p<0.01）,在可见光的400~700 nm以及近红外的1 100~1 700和2 200~2 400 nm附近具有较强的相关性;（2）通过比较4种小波基函数对光谱数据中有效信息的辨识能力,认为小波基函数bior1.3和mexh要优于db4和gaus4,其中bior1.3的光谱分解效果最好,gaus4相对最弱;通过bior1.3第5尺度的光谱变换,与土壤有害元素砷显著相关的波段数量最多,为507个（p<0.01）;（3）比较4种建模方法的反演结果发现,SVMR,BPNN和RFR模型相较于PLSR模型具有更强的估测能力,模型的估测精度更高。综合分析各模型的稳定性及估测精度后,认为bior1.3-25-RFR模型可作为研究区土壤有害元素砷的最佳估测模型。该模型的训练集和验证集的R2分别为0.893和0.639,RMSE为1.075和1.651 mg·kg-1,RPD分别为2.89和1.64,表明模型估测效果较好,稳定性较强。采用合适的小波基函数进行连续小波变换可减少土壤高光谱数据中的白噪声,挖掘出土壤光谱数据中的有效信息,对土壤有害元素砷含量的准确估测提供有力的技术保障。     

推进－迭代算法计算效率的研究

本文对求解三维定常超音速动性流场的一次空间推进，在每一个推进站沿伪时间层局部迭代的推进－迭代算法作了进一步的研究．在每一推进站（侧向平面）沿伪时间层局部迭代时，给出了四种不同的隐式迭代方法，即沿侧面两个方向（法向和周向）全用隐式；法向隐式而周向采用Ｇａｕｓｓ－Ｓｉｌｄｌｅ来回扫描迭代；法向隐式而周向显式及以系数矩阵谱半径代替系数矩阵的简化标量隐式算法．用这四种算法模拟了三维球锥黏性绕流，给出了四种不同算法的计算效率和收敛特性比较．     

无条件稳定数值积分方法在拟动力实验中的应用研究

用无条件稳定的隐式α－方法代替目前的条件稳定的显式方法，通过数值迭代控制方法实现了拟动力实验．在此基础上进一步应用子结构技术，解决了刚度大、自由度较多结构采用传统的条件稳定数值积分方法进行拟动力实验的问题．应用不同数值积分方法进行的三层模型结构的实验结果表明，无条件稳定的数值积分方法的实验精度优于条件稳定的数值积分方法的精度．文中还就实验误差的控制补偿问题进行了讨论，提出了采用瞬时割线刚度进行补偿的方法     

On numerical solution of dynamic problems in the theory of reinforced shells

Dynamic problems for cylindrical shells reinforced with discrete ribs are examined. A numerical algorithm based on Richardson extrapolation is developed. Specific problems are solved, and the results are analyzed __________ Translated from Prikladnaya Mekhanika, Vol. 42, No. 5, pp. 50–56, May 2006.